Near-Optimal Fingerprinting with Constraints
نویسندگان
چکیده
Several recent studies have demonstrated that people show large behavioural uniqueness. This has serious privacy implications as most individuals become increasingly re-identifiable in large datasets or can be tracked, while they are browsing the web, using only a couple of their attributes, called as their fingerprints. Often, the success of these attacks depends on explicit constraints on the number of attributes learnable about individuals, i.e., the size of their fingerprints. These constraints can be budget as well as technical constraints imposed by the data holder. For instance, Apple restricts the number of applications that can be called by another application on iOS in order to mitigate the potential privacy threats of leaking the list of installed applications on a device. In this work, we address the problem of identifying the attributes (e.g., smartphone applications) that can serve as a fingerprint of users given constraints on the size of the fingerprint. We give the best fingerprinting algorithms in general, and evaluate their effectiveness on several real-world datasets. Our results show that current privacy guards limiting the number of attributes that can be queried about individuals is insufficient to mitigate their potential privacy risks in many practical cases. DOI 10.1515/popets-2016-0051 Received 2016-02-29; revised 2016-06-02; accepted 2016-06-02.
منابع مشابه
COMPARISON BETWEEN MINIMUM AND NEAR MINIMUM TIME OPTIMAL CONTROL OF A FLEXIBLE SLEWING SPACECRAFT
In this paper, a minimum and near-minimum time optimal control laws are developed and compared for a rigid space platform with flexible links during an orientating maneuver with large angle of rotation. The control commands are considered as typical bang-bang with multiple symmetrical switches, the time optimal control solution for the rigid-body mode is obtained as a bang-bang function and app...
متن کاملNear-Minimum Time Optimal Control of Flexible Spacecraft during Slewing Maneuver
The rapid growth of space utilization requires extensive construction, and maintenance of space structures and satellites in orbit. 
This will, in turn, substantiate application of robotic systems in space. In this paper, a near-minimum-time optimal control law is developed for a rigid space platform with flexible links during an orientating maneuver with large angle of rotation. The time op...
متن کاملNear-Minimum Time Optimal Control of Flexible Spacecraft during Slewing Maneuver
The rapid growth of space utilization requires extensive construction, and maintenance of space structures and satellites in orbit. This will, in turn, substantiate application of robotic systems in space. In this paper, a near-minimum-time optimal control law is developed for a rigid space platform with flexible links during an orientating maneuver with large angle of rotation. The time opti...
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملTHE EFFECTS OF INITIAL SAMPLING AND PENALTY FUNCTIONS IN OPTIMAL DESIGN OF TRUSSES USING METAHEURISTIC ALGORITHMS
Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...
متن کاملMangasarian-Fromovitz and Zangwill Conditions For Non-Smooth Infinite Optimization problems in Banach Spaces
In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are Lipschitz near the optimal solution. Necessary optimality conditions and constraint qualifications in terms of Michel-Penot subdifferential are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- PoPETs
دوره 2016 شماره
صفحات -
تاریخ انتشار 2016